Efficient Optimisation Framework for Convolutional Neural Networks with Secure Multiparty Computation

نویسندگان

چکیده

In recent years, deep learning has become an increasingly popular approach to modelling data due its ability detect abstract underlying patterns in data. Its practical applications have been limited, however, by privacy concerns, restricting use major sectors such as healthcare and banking. Secure multiparty computation (MPC) is a scheme which allows multiple parties perform joint computations over private data, while keeping the content of their secret. MPC can enable privacy-preserving machine learning, however current implementations are rarely applied practice prohibitively high cost performing thousands transmitting between parties. this paper we propose framework incorporating various optimisation approaches from wider field including batch normalisation polynomial approximation activation functions, evaluate performance when convolutional neural network (CNN), discussing trade-off each offers terms accuracy efficiency. We experiment with parametric (PPoly) activations deriving approximations functions allowing tune coefficients weights. will show that, shallow CNNs, application combination PPoly layer result faster convergence, testing exceeding that achieved unencrypted network, at longer running times.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcast-Efficient Secure Multiparty Computation

Secure multiparty computation (MPC) is perhaps the most popular paradigm in the area of cryptographic protocols. It allows several mutually untrustworthy parties to jointly compute a function of their private inputs, without revealing to each other information about those inputs. In the case of unconditional (information-theoretic) security, protocols are known which tolerate a dishonest minori...

متن کامل

Efficient Secure Multiparty Computation with Identifiable Abort

We study secure multiparty computation (MPC) in the dishonest majority setting providing security with identifiable abort, where if the protocol aborts, the honest parties can agree upon the identity of a corrupt party. All known constructions that achieve this notion require expensive zeroknowledge techniques to obtain active security, so are not practical. In this work, we present the first e...

متن کامل

Efficient Maliciously Secure Multiparty Computation for RAM

A crucial issue, that mostly affects the performance of actively secure computation of RAM programs, is the task of reading/writing from/to memory in a private and authenticated manner. Previous works in the active security and multiparty settings are based purely on the SPDZ (reactive) protocol, hence, memory accesses are treated just like any input to the computation. However, a garbled-circu...

متن کامل

Round Efficient Unconditionally Secure Multiparty Computation Protocol

In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel, which communicates O(n4) field elements per multiplication and requires O(n log(n) + D) rounds, even if up to t players are under the control of an active adversary having unbounded computi...

متن کامل

Secure Multiparty Computation between Distrusted Networks Terminals

One of the most important problems facing any distributed application over a heterogeneous network is the protection of private sensitive information in local terminals. A subfield of cryptography called secure multiparty computation (SMC) is the study of such distributed computation protocols that allow distrusted parties to perform joint computation without disclosing private data. SMC is inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Security

سال: 2022

ISSN: ['0167-4048', '1872-6208']

DOI: https://doi.org/10.1016/j.cose.2022.102679